Complementary graphs with flows less than three
نویسندگان
چکیده
منابع مشابه
Graphs with three distinct eigenvalues and largest eigenvalue less than
Article history: Received 13 June 2008 Accepted 13 November 2008 Available online xxxx Submitted by R.A. Brualdi AMS classification: 05C50
متن کاملDecomposing graphs into forests of paths with size less than three
A forest in which every component is path is caned a path forest. A family of path forests whose edge sets form a partition of the set of a graph G is called a path of G. The minimum number of forests in a path decomposition of a graph G is the path number of G and denoted by p( G). If we restrict the number of edges in each path to be at most x then we obtain a special decomposition. The minim...
متن کاملAll graphs with restrained domination number three less than their order
For a graph G = (V,E), a set S ⊆ V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S as well as another vertex in V − S. The restrained domination number of G, denoted by γr(G), is the smallest cardinality of a restrained dominating set of G. In this paper we find all graphs G satisfying γr(G) = n− 3, where n is the order of G.
متن کاملMaximal Nontraceable Graphs with Toughness less than One
A graph G is maximal nontraceable (MNT) if G does not have a hamiltonian path but, for every e ∈ E (
متن کاملGraphs with fourth Laplacian eigenvalue less than two
In this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than two are determined, which are used to characterize all connected graphs with exactly three Laplacian eigenvalues no less than two. Moreover, we determine bipartite graphs such that the adjacency matrices of their line graphs have exactly three nonnegative eigenvalues. © 2003 Elsevier Ltd. All rights reser...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2020
ISSN: 0012-365X
DOI: 10.1016/j.disc.2019.111809